Four Small Puzzles That Rosetta Doesn't Solve

نویسنده

  • Rhiju Das
چکیده

A complete macromolecule modeling package must be able to solve the simplest structure prediction problems. Despite recent successes in high resolution structure modeling and design, the Rosetta software suite fares poorly on small protein and RNA puzzles, some as small as four residues. To illustrate these problems, this manuscript presents Rosetta results for four well-defined test cases: the 20-residue mini-protein Trp cage, an even smaller disulfide-stabilized conotoxin, the reactive loop of a serine protease inhibitor, and a UUCG RNA tetraloop. In contrast to previous Rosetta studies, several lines of evidence indicate that conformational sampling is not the major bottleneck in modeling these small systems. Instead, approximations and omissions in the Rosetta all-atom energy function currently preclude discriminating experimentally observed conformations from de novo models at atomic resolution. These molecular "puzzles" should serve as useful model systems for developers wishing to make foundational improvements to this powerful modeling suite.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hardness Amplification of Weakly Verifiable Puzzles

Is it harder to solve many puzzles than it is to solve just one? This question has different answers, depending on how you define puzzles. For the case of inverting one-way functions it was shown by Yao that solving many independent instances simultaneously is indeed harder than solving a single instance (cf. the transformation from weak to strong one-way functions). The known proofs of that re...

متن کامل

Intrinsic vs. Extrinsic Motivation in an Interactive Engineering Game

In this paper, we study intrinsic vs. extrinsic motivation in players playing an electrical engineering gaming environment. We used UNTANGLED, a highly interactive game to conduct this study. This game is developed to solve complex mapping problem from electrical engineering using human intuitions. Our goal is to find whether there are differences in the ways anonymous players solved electrical...

متن کامل

Generating Sudoku Puzzles as an Inverse Problem

This paper examines the generation of Sudoku puzzles as an inverse problem, with the intention of engineering Sudoku puzzles with desired properties. We examine a number of methods that are commonly used to solve Sudoku puzzles, and then construct methods to invert each. Then, starting with a completed Sudoku board, we apply these inverse methods to construct a puzzle with a small set of clues....

متن کامل

Solving Sudoku Puzzles Based on Customized Information Entropy

Conception and calculation method of information entropy is customized for Sudoku puzzles and a corresponding algorithm is designed to solve Sudoku puzzles. The definitions of inverse information entropy and information amount for inverse information entropy are also introduced and directly used instead of information entropy in order to simplify the solving procedure. Experimental results show...

متن کامل

Sudoku as a SAT Problem

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011